Confluence Results for a Quantum Lambda Calculus with Measurements
نویسندگان
چکیده
A strong confluence result for Q, a quantum λ-calculus with measurements, is proved. More precisely, confluence is shown to hold both for finite and infinite computations. The technique used in the confluence proof is syntactical but innovative. This makes Q different from similar quantum lambda calculi, which are either measurement-free or provided with a reduction strategy.
منابع مشابه
Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits
This paper demonstrates how to add a measurement operator to quantum λ-calculi. A proof of the consistency of the semantics is given through a proof of confluence presented in a sufficiently general way to allow this technique to be used for other languages. The method described here may be applied to probabilistic rewrite systems in general, and to add measurement to more complex languages suc...
متن کاملQuantum Lambda Calculi with Classical Control: Syntax and Expressive Power
We study an untyped λ–calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We prove subject reduction, confluence and a standardization theorem. Moreover, we prove the computational equivalence of the proposed calculus with a suitable class...
متن کاملThe dagger lambda calculus
We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols [4] into the rich and well established tradition of type theory. Our construction extends the linear typed lambda calculus [6] with a linear negation [1] of ”trivialised” De Morgan duality [5]. Reduction is realised through explicit substitution, based on a symmetric notion of binding of glo...
متن کاملOn a measurement-free quantum lambda calculus with classical control
We study a measurement-free, untyped λ-calculus with quantum data and classical control. This work arises from previous proposals by Selinger and Valiron, and Van Tonder. We focus on operational and expressiveness issues, rather than (denotational) semantics. We prove subject reduction and confluence, and a standardisation theorem. Moreover, we prove the computational equivalence of the propose...
متن کاملLabeling techniques and typed fixed-point operators
Labeling techniques for untyped lambda calculus were developed by Lévy, Hyland, Wadsworth and others in the 1970’s. A typical application is the proof of confluence from finiteness of developments: by labeling each subterm with a natural number indicating the maximum number of times this term may participate in a reduction step, we obtain a strongly-normalizing approximation of β, η -reduction....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 270 شماره
صفحات -
تاریخ انتشار 2011